#include<iostream>
#include<deque>
#include<algorithm>
using namespace std;

namespace test1 {
	void PrintDeque(const deque<int>& d)
	{
		for (deque<int>::const_iterator i = d.begin(); i != d.end(); i++)
		{
			cout << *i << " ";
		}
		cout << endl;
	};

	void fun1()
	{
		deque<int> d1;
		for (int i = 0; i < 10; i++)
		{
			d1.push_back(i);
		}
		PrintDeque(d1);

		deque<int> d2(d1.begin(), d1.end());
		PrintDeque(d2);

		deque<int> d3(10, 999);
		PrintDeque(d3);

		deque<int> d4(d1);
		PrintDeque(d4);
	}

	int main10()
	{
		//fun1();
		deque<int> de;
		de.push_back(20);
		de.push_back(180);
		de.push_back(54);
		de.push_back(70);
		de.push_back(13);
		PrintDeque(de);

		sort(de.begin(), de.end());
		PrintDeque(de);

		return 0;
	}
}